The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
quot(0, s(y)) → 0
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0, y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0)), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0)))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
minus(s(x), s(y)) →⁺ minus(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
minus, quot, plus

They will be analysed ascendingly in the following order:
minus < quot
minus < plus

(8) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
minus, quot, plus

They will be analysed ascendingly in the following order:
minus < quot
minus < plus

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Induction Base:
minus(gen_0':s2_0(0), gen_0':s2_0(0)) →_R^Ω(1)
gen_0':s2_0(0)

Induction Step:
minus(gen_0':s2_0(+(n4_0, 1)), gen_0':s2_0(+(n4_0, 1))) →_R^Ω(1)
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) →_IH
gen_0':s2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
quot, plus

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol quot.

(13) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
plus

(14) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s2_0(n310_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n310_0, b)), rt ∈ Ω(1 + n310₀)

Induction Base:
plus(gen_0':s2_0(0), gen_0':s2_0(b)) →_R^Ω(1)
gen_0':s2_0(b)

Induction Step:
plus(gen_0':s2_0(+(n310_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
s(plus(gen_0':s2_0(n310_0), gen_0':s2_0(b))) →_IH
s(gen_0':s2_0(+(b, c311_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(15) Complex Obligation (BEST)

(16) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n310_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n310_0, b)), rt ∈ Ω(1 + n310₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(18) BOUNDS(n^1, INF)

(19) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n310_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n310_0, b)), rt ∈ Ω(1 + n310₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(20) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(21) BOUNDS(n^1, INF)

(22) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
plus(minus(x, s(0')), minus(y, s(s(z)))) → plus(minus(y, s(s(z))), minus(x, s(0')))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n4₀)

(24) BOUNDS(n^1, INF)